Offspring Generation Method Using Delaunay Triangulation for Real-Coded Genetic Algorithms
نویسندگان
چکیده
To design crossover operators with high search ability in realcoded Genetic Algorithms, it will be efficient to utilize both information regarding the parent distribution and the landscape of the objective function. Here, we propose a new offspring generation method using Delaunay triangulation. The proposed method can concentrate offspring in regions with a satisfactory evaluation value, inheriting the parent distribution. Through numerical examples, the proposed method was shown to be capable of deriving the optimum with a smaller population size and lower number of evaluations than Simplex Crossover, which uses only information of the parent distribution.
منابع مشابه
Surface Meshing Using Vertex Insertion
This paper presents the requirements for a surface mesh to be valid. Aside from validity, it also discusses conditions for geometric similarity, which quantitatively describes how the surface mesh “matches” the model geometry. The surface mesh generation method presented here uses the parameter space of a model face to generate a coarse triangulation. In order to avoid the mapping problem, the ...
متن کاملEfficient parallel implementations of near Delaunay triangulation with High Performance Fortran
Unstructured mesh generation exposes highly irregular computation patterns, which imposes a challenge in implementing triangulation algorithms on parallel machines. This paper reports on an efficient parallel implementation of near Delaunay triangulation with High Performance Fortran (HPF). Our algorithm exploits embarrassing parallelism by performing sub-block triangulation and boundary merge ...
متن کاملAdaptive Unstructured Grid Generation Scheme for Solution of the Heat Equation
An adaptive unstructured grid generation scheme is introduced to use finite volume (FV) and finite element (FE) formulation to solve the heat equation with singular boundary conditions. Regular grids could not acheive accurate solution to this problem. The grid generation scheme uses an optimal time complexity frontal method for the automatic generation and delaunay triangulation of the grid po...
متن کاملComputing 2D Constrained Delaunay Triangulation Using Graphics Hardware
This paper presents a novel approach, termed GPU-CDT, to compute the constrained Delaunay triangulation (CDT) for a planar straight line graph (PSLG), consisting of points and edges, using the graphics processing unit (GPU). Although there are many algorithms for constructing the 2D CDT using the CPU, there has been no known prior approach using the parallel computing power of the GPU efficient...
متن کاملConstrained Delaunay Triangulation using Plane Subdivision
This paper presents an algorithm for obtaining a constrained Delaunay triangulation from a given planar graph. The main advantage towards other algorithms is that I use an efficient Žalik’s algorithm, using a plane subdivison for obtaining a Delaunay triangulation. It is used for insertion of points into existing triangulation. The other part of algorithm presents a method for inserting edges, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006